69 research outputs found

    Interlaboratory exercise for the analysis of carotenoids and related compounds in dried mango fruit (Mangifera indica L.)

    Get PDF
    An interlaboratory comparison was done for the analysis of carotenoids in freeze-dried mango. The study was performed from July to September 2018. Mango fruit was freeze-dried, homogenized, and packaged under vacuum conditions in portions of 6 g (test sample). Two test samples were sent to the participating laboratories for analysis. Laboratory results were rated using Z-scores in accordance with ISO 13528 and ISO 17043. The standard deviation for proficiency assessment (also called target standard deviation) was determined using a modified Horwitz function and varied between 10% and 25%, depending on the analyte. Out of 14 laboratories from 10 different countries, 9 laboratories (64%) obtained a satisfactory performance (Z ≤ 2) for the analysis of β-carotene. While for 7 laboratories that analyzed α-carotene, (9Z)-β-carotene, β-cryptoxanthin, and zeaxanthin, 4 laboratories (57%) obtained a satisfactory performance. However, only 2 laboratories out of 7 (29%) obtained a satisfactory performance for lutein. Based on the comparability of the analytical results, this study concludes that freeze-dried mango pulp can be used as a reference material for the analysis of α and β-carotene, (9Z)-β-carotene, β-cryptoxanthin, and zeaxanthin by applying different analytical procedures for their extraction and quantification

    Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors

    Get PDF
    Small 8-bit RISC processors and micro-controllers based on the AVR instruction set architecture are widely used in the embedded domain with applications ranging from smartcards over control systems to wireless sensor nodes. Many of these applications require asymmetric encryption or authentication, which has spurred a body of research into implementation aspects of Elliptic Curve Cryptography (ECC) on the AVR platform. In this paper, we study the suitability of a special class of finite fields, the so-called Optimal Prime Fields (OPFs), for a "lightweight" implementation of ECC with a view towards high performance and security. An OPF is a finite field Fp defined by a prime of the form p = u*2^k + v, whereby both u and v are "small" (in relation to 2^k) so that they fit into one or two registers of an AVR processor. OPFs have a low Hamming weight, which allows for a very efficient implementation of the modular reduction since only the non-zero words of p need to be processed. We describe a special variant of Montgomery multiplication for OPFs that does not execute any input-dependent conditional statements (e.g. branch instructions) and is, hence, resistant against certain side-channel attacks. When executed on an Atmel ATmega processor, a multiplication in a 160-bit OPF takes just 3237 cycles, which compares favorably with other implementations of 160-bit modular multiplication on an 8-bit processor. We also describe a performance-optimized and a security-optimized implementation of elliptic curve scalar multiplication over OPFs. The former uses a GLV curve and executes in 4.19M cycles (over a 160-bit OPF), while the latter is based on a Montgomery curve and has an execution time of approximately 5.93M cycles. Both results improve the state-of-the-art in lightweight ECC on 8-bit processors

    MoTE-ECC: Energy-Scalable Elliptic Curve Cryptography for Wireless Sensor Networks

    Get PDF
    Wireless Sensor Networks (WSNs) are susceptible to a wide range of malicious attacks, which has stimulated a body of research on "light-weight" security protocols and cryptographic primitives that are suitable for resource-restricted sensor nodes. In this paper we introduce MoTE-ECC, a highly optimized yet scalable ECC library for Memsic's MICAz motes and other sensor nodes equipped with an 8-bit AVR processor. MoTE-ECC supports scalar multiplication on Montgomery and twisted Edwards curves over Optimal Prime Fields (OPFs) of variable size, e.g. 160, 192, 224, and 256 bits, which allows for various trade-offs between security and execution time (resp. energy consumption). OPFs are a special family of "low-weight" prime fields that, in contrast to the NIST-specified fields, facilitate a parameterized implementation of the modular arithmetic so that one and the same software function can be used for operands of different length. To demonstrate the performance of MoTE-ECC, we take (ephemeral) ECDH key exchange between two nodes as example, which requires each node to execute two scalar multiplications. The first scalar multiplication is performed on a fixed base point (to generate a key pair), whereas the second scalar multiplication gets an arbitrary point as input. Our implementation uses a fixed-base comb method on a twisted Edwards curve for the former and a simple ladder approach on a birationally-equivalent Montgomery curve for the latter. Both scalar multiplications require about 9*10^6 clock cycles in total and occupy only 380 bytes in RAM when the underlying OPF has a length of 160 bits. We also describe our efforts to harden MoTE-ECC against side-channel attacks (e.g. simple power analysis) and introduce a highly regular implementation of the comb method

    Fundamental properties of five Kepler stars using global asteroseismic quantities and ground-based observations

    Full text link
    We present an asteroseismic study of the solar-like stars KIC 11395018, KIC 10273246, KIC 10920273, KIC 10339342, and KIC 11234888 using short-cadence time series of more than eight months from the Kepler satellite. For four of these stars, we derive atmospheric parameters from spectra acquired with the Nordic Optical Telescope. The global seismic quantities (average large frequency separation and frequency of maximum power), combined with the atmospheric parameters, yield the mean density and surface gravity with precisions of 2% and ~0.03 dex, respectively. We also determine the radius, mass, and age with precisions of 2-5%, 7-11%, and ~35%, respectively, using grid-based analyses. We determine asteroseismic distances to these stars with a precision better than 10%, and constrain the stellar inclination for three of the stars. An Li abundance analysis yields an independent estimate of the age, but this is inconsistent with the asteroseismically determined age for one of the stars. We compare the results from five different grid-based analyses, and we find that they all provide radius and mass values to within 2.4sigma. The absence of a metallicity constraint when the average large frequency separation is measured with a precision of 1% biases the fitted radius and mass for the stars with non-solar metallicity (metal-rich KIC 11395018 and metal-poor KIC 10273246), while including a metallicity constraint reduces the uncertainties in both of these parameters by almost a factor of two. We found that including the average small frequency separation improves the determination of the age only for KIC 11395018 and KIC 11234888, and for the latter this improvement was due to the lack of strong atmospheric constraints. (Abridged).Comment: accepted A&A, 14 two-column pages + appendix, 5 figures, 15 table
    corecore